Graphs That Admit Polyline Drawings with Few Crossing Angles
نویسندگان
چکیده
We consider graphs that admit polyline drawings where all crossings occur at the same angle α ∈ (0, π2 ]. We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This result remains true when each crossing occurs at an angle from a small set of angles. We also provide several extensions that might be of independent interest.
منابع مشابه
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
We consider graphs that admit polyline drawings where all crossings occur at the same angle α ∈ (0, π 2 ]. We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This result remains true when each crossing occurs at an angle from a small set of angles. We also provide several extensions that might be of independent interest.
متن کاملOn the Perspectives Opened by Right Angle Crossing Drawings
Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the readability of a drawing if edges cross at right angles. We investigate to what extent RAC drawings can help in overcoming the limitations of widely a...
متن کاملSchool of Information Technologies Circular Graph Drawings with Large Crossing Angles
This paper is motivated by empirical research that has shown that increasing the angle of edge crossings reduces the negative effect of crossings on human readability. We investigate circular graph drawings (where each vertex lies on a circle) with large crossing angles. In particular, we consider the case of right angle crossing (RAC) drawings, where each crossing angle is π/2. We characterize...
متن کاملDrawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
In point-set-embeddability (PSE) problems one is given not just a graph that is to be drawn, but also a set of points in the plane that specify where the vertices of the graph can be placed. The problem class was introduced by Gritzmann et al. [3] twenty years ago. In their work and most other works, however, planarity of the output drawing was an essential requirement. Recent experiments on th...
متن کاملStraight - Line Drawings on Restricted
This paper investigates the following question: Given an integer grid , where is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit straight-line crossing-free drawings with vertices located at the grid points of ? We characterize the trees that can be drawn on a two dimensional c n k grid, where k and c are given integer constants, and on a two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 26 شماره
صفحات -
تاریخ انتشار 2012